Rank Modifications of Semi-definite Matrices with Applications to Secant Updates
نویسنده
چکیده
The BFGS and DFP updates are perhaps the most successful Hessian and inverse Hessian approximations respectively for unconstrained minimization problems. This paper describes these methods in terms of two successive steps: rank reduction and rank restoration. From rank subtractivity and a powerful spectral result, the first step must necessarily result in a positive semidefinite matrix; and the second step is designed to restore positive definiteness. The goal of the research is to better understand the workings of the BFGS and DFP updates to see how they may be modified and yet retain their basic rank and spectral characteristics. The class of BFGS and DFP updates is generalized both in terms of choices for update vectors and rank of the modifications in the formulas. The rank restoration step generalizes naturally to rectangular matrices.
منابع مشابه
On a Geometric Interpretation of the Positive Definite Secant Updates Bfgs and Dfp from the Wedderburn Formula
The BFGS update and the DFP update perhaps are respectively the most successful Hessian and inverse Hessian approximations for unconstrained minimization problems This paper describes a geometric meaning of these updates understood from the Wedderburn rank one reduction formula
متن کاملHistorical Development of the BFGS Secant Method and Its Characterization Properties by Joanna Maria Papakonstantinou
Historical Development of the BFGS Secant Method and Its Characterization Properties by Joanna Maria Papakonstantinou The BFGS secant method is the preferred secant method for finite-dimensional unconstrained optimization. The first part of this research consists of recounting the historical development of secant methods in general and the BFGS secant method in particular. Many people believe t...
متن کاملImproved Hessian approximation with modified secant equations for symmetric rank-one method
Symmetric rank-one (SR1) is one of the competitive formulas among the quasi-Newton (QN) methods. In this paper, we propose some modified SR1 updates based on the modified secant equations, which use both gradient and function information. Furthermore, to avoid the loss of positive definiteness and zero denominators of the new SR1 updates, we apply a restart procedure to this update. Three new a...
متن کاملMultiple-Rank Modifications of a Sparse Cholesky Factorization
Given a sparse symmetric positive definite matrix AAT and an associated sparse Cholesky factorization LDLT or LLT, we develop sparse techniques for updating the factorization after either adding a collection of columns to A or deleting a collection of columns from A. Our techniques are based on an analysis and manipulation of the underlying graph structure, using the framework developed in an e...
متن کاملNonlinear Krylov-Secant Solvers∗
This report describes a new family of Newton-Krylov methods for solving nonlinear systems of equations arising from the solution of Richards’ equation and in fully implicit formulations in air-water systems. The basic approach is to perform secant (Broyden) updates restricted to the Krylov subspace generated by the GMRES iterative solver. This approach is introduced as Krylov-secant methods. On...
متن کامل